On the simplification of infinite morphic words

The Monadic Theory of Morphic Infinite Words and Generalizations

The Monadic Theory of Morphic Infinite Words and Generalizations

On the Periodicity of Morphic Words

Given a morphism h prolongable on a and an integer p, we present an algorithm that calculates which letters occur infinitely often in congruent positions modulo p in the infinite word h(a). As a corollary, we show that it is decidable whether a morphic word is ultimately p-periodic. Moreover, using our algorithm we can find the smallest similarity relation such that the morphic word is ultimate...

On the Asymptotic Abelian Complexity of Morphic Words

The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts this number up to letter permutation. Although a lot of research has been done on the subword complexity of morphic words, i.e., words obtained as fixed points of iterated morphisms, little is known on their abelian complexity. In this paper, we undertake the classific...

Extremal words in morphic subshifts

Given an infinite word x over an alphabet A, a letter b occurring in x, and a total order σ on A, we call the smallest word with respect to σ starting with b in the shift orbit closure of x an extremal word of x. In this paper we consider the extremal words of morphic words. If x = g(fω(a)) for some morphisms f and g, we give two simple conditions on f and g that guarantees that all extremal wo...